Randomized Online Algorithms with High Probability Guarantees

We study the relationship between the competitive ratio and the tail distribution of randomized online problems. To this end, we define a broad class of online problems that includes some of the well-studied problems like paging, k-server and metrical task systems on finite metrics, and show that for these problems it is possible to obtain, given an algorithm with constant expected competitive ratio, another algorithm that achieves the same solution quality up to an arbitrarily small constant error with high probability; the "high probability" statement is in terms of the optimal cost. Furthermore, we show that our assumptions are tight in the sense that removing any of them allows for a counterexample to the theorem

Randomized online computation with high probability guarantees

We study the relationship between the competitive ratio and the tail distribution of randomized online minimization problems. To this end, we define a broad class of online problems that includes some of the well-studied problems like paging, k-server and metrical task systems on finite metrics, and show that for these problems it is possible to obtain, given an algorithm with constant expected competitive ratio, another algorithm that achieves the same solution quality up to an arbitrarily small constant error a with high probability; the "high probability" statement is in terms of the optimal cost. Furthermore, we show that our assumptions are tight in the sense that removing any of them allows for a counterexample to the theorem. In addition, there are examples of other problems not covered by our definition, where similar high probability results can be obtained.Comment: 20 pages, 2 figure

Advice Complexity of the Online Induced Subgraph Problem

Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples of such problems include maximum independent set, maximum planar graph, and many others. We consider these problems, where the vertices are presented online. With each vertex, the online algorithm must decide whether to include it into the constructed subgraph, based only on the subgraph induced by the vertices presented so far. We study the properties that are common to all these problems by investigating the generalized problem: for a hereditary property \pty, find some maximal induced subgraph having \pty. We study this problem from the point of view of advice complexity. Using a result from Boyar et al. [STACS 2015], we give a tight trade-off relationship stating that for inputs of length n roughly n/c bits of advice are both needed and sufficient to obtain a solution with competitive ratio c, regardless of the choice of \pty, for any c (possibly a function of n). Surprisingly, a similar result cannot be obtained for the symmetric problem: for a given cohereditary property \pty, find a minimum subgraph having \pty. We show that the advice complexity of this problem varies significantly with the choice of \pty. We also consider preemptive online model, where the decision of the algorithm is not completely irreversible. In particular, the algorithm may discard some vertices previously assigned to the constructed set, but discarded vertices cannot be reinserted into the set again. We show that, for the maximum induced subgraph problem, preemption cannot help much, giving a lower bound of $\Omega(n/(c^2\log c))$ bits of advice needed to obtain competitive ratio $c$, where $c$ is any increasing function bounded by \sqrt{n/log n}. We also give a linear lower bound for c close to 1

Advice Complexity of the Online Induced Subgraph Problem

Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples include maximum independent set, maximum planar graph, maximum clique, minimum feedback vertex set, and many others. In online versions of these problems, the vertices of the graph are presented in an adversarial order, and with each vertex, the online algorithm must irreversibly decide whether to include it into the constructed subgraph, based only on the subgraph induced by the vertices presented so far. We study the properties that are common to all these problems by investigating a generalized problem: for an arbitrary but fixed hereditary property pi, find some maximal induced subgraph having pi. We investigate this problem from the point of view of advice complexity, i.e., we ask how some additional information about the yet unrevealed parts of the input can influence the solution quality. We evaluate the information in a quantitative way by considering the best possible advice of given size that describes the unknown input. Using a result from Boyar et al. [STACS 2015, LIPIcs 30], we give a tight trade-off relationship stating that, for inputs of length n, roughly n/c bits of advice are both needed and sufficient to obtain a solution with competitive ratio c, regardless of the choice of pi, for any c (possibly a function of n). This complements the results from Bartal et al. [SIAM Journal on Computing 36(2), 2006] stating that, without any advice, even a randomized algorithm cannot achieve a competitive ratio better than Omega(n^{1-log_{4}3-o(1)}). Surprisingly, for a given cohereditary property pi and the objective to find a minimum subgraph having pi, the advice complexity varies significantly with the choice of pi. We also consider a preemptive online model, inspired by some applications mainly in networking and scheduling, where the decision of the algorithm is not completely irreversible. In particular, the algorithm may discard some vertices previously assigned to the constructed set, but discarded vertices cannot be reinserted into the set. We show that, for the maximum induced subgraph problem, preemption does not significantly help by giving a lower bound of Omega(n/(c^2log c)) on the bits of advice that are needed to obtain competitive ratio c, where c is any increasing function bounded from above by sqrt(n/log n). We also give a linear lower bound for c close to 1

Finding Optimal Solutions With Neighborly Help

Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal colorings for all one-edge-deleted subgraphs? Studying such questions not only gives detailed insight into the structure of the problem itself, but also into the complexity of related problems; most notably graph theory\u27s core notion of critical graphs (e.g., graphs whose chromatic number decreases under deletion of an arbitrary edge) and the complexity-theoretic notion of minimality problems (also called criticality problems, e.g., recognizing graphs that become 3-colorable when an arbitrary edge is deleted). We focus on two prototypical graph problems, Colorability and Vertex Cover. For example, we show that it is NP-hard to compute an optimal coloring for a graph from optimal colorings for all its one-vertex-deleted subgraphs, and that this remains true even when optimal solutions for all one-edge-deleted subgraphs are given. In contrast, computing an optimal coloring from all (or even just two) one-edge-added supergraphs is in P. We observe that Vertex Cover exhibits a remarkably different behavior, demonstrating the power of our model to delineate problems from each other more precisely on a structural level. Moreover, we provide a number of new complexity results for minimality and criticality problems. For example, we prove that Minimal-3-UnColorability is complete for DP (differences of NP sets), which was previously known only for the more amenable case of deleting vertices rather than edges. For Vertex Cover, we show that recognizing beta-vertex-critical graphs is complete for Theta_2^p (parallel access to NP), obtaining the first completeness result for a criticality problem for this class

Reoptimization of the Shortest Common Superstring Problem

A reoptimization problem describes the following scenario: given an instance of an optimization problem together with an optimal solution for it, we want to find a good solution for a locally modified instance. In this paper, we deal with reoptimization variants of the shortest common superstring problem (SCS) where the local modifications consist of adding or removing a single string. We show the NP-hardness of these reoptimization problems and design several approximation algorithms for them. First, we use a technique of iteratively using any SCS algorithm to design an approximation algorithm for the reoptimization variant of adding a string whose approximation ratio is arbitrarily close to 8/5 and another algorithm for deleting a string with a ratio tending to 13/7. Both algorithms significantly improve over the best currently known SCS approximation ratio of 2.5. Additionally, this iteration technique can be used to design an improved SCS approximation algorithm (without reoptimization) if the input instance contains a long string, which might be of independent interest. However, these iterative algorithms are relatively slow. Thus, we present another, faster approximation algorithm for inserting a string which is based on cutting the given optimal solution and achieves an approximation ratio of 11/6. Moreover, we give some lower bounds on the approximation ratio which can be achieved by algorithms that use such cutting strategie

Формирование профилированных импульсов напряжения для время пролетного спектрометра

В работе рассматривается возможность создания время пролетного спектрометра (ВПР) с высокой разрешающей способностью. Работа прибора основана на использовании временной группировки ионов с монотонно растущей энергией, задаваемой в анализирующим элементе ВПР спектрометра. Основная задача получения профилированных импульсов ускоряющего ионы напряжения решается с использованием оригинального формирователя, с включенной параллельно нагрузке предварительно заряженной емкости задающей уровень коррекции напряжения. Проведено моделирование различных модификаций генераторов импульсов. Разработан формирователь с частичным разрядом накопительной емкости и полупроводниковым коммутаторомThe paper considers the possibility of creating a time-of-flight spectrometer with high resolution. The operation of the device is based on the use of a time grouping of ions with a monotonically increasing energy, set in the analyzing element of the spectrometer. The main task of obtaining profiled pulses of ion-accelerating voltage is solved using an original shaper, with a pre-charged capacitance connected in parallel to the load, which sets the level of voltage correction. Various modifications of pulse generators are modeled. A shaper with a partial discharge of the storage capacity and a semiconductor switch has been develope

Differential cross section measurements for the production of a W boson in association with jets in proton–proton collisions at √s = 7 TeV

Measurements are reported of differential cross sections for the production of a W boson, which decays into a muon and a neutrino, in association with jets, as a function of several variables, including the transverse momenta (pT) and pseudorapidities of the four leading jets, the scalar sum of jet transverse momenta (HT), and the difference in azimuthal angle between the directions of each jet and the muon. The data sample of pp collisions at a centre-of-mass energy of 7 TeV was collected with the CMS detector at the LHC and corresponds to an integrated luminosity of 5.0 fb[superscript −1]. The measured cross sections are compared to predictions from Monte Carlo generators, MadGraph + pythia and sherpa, and to next-to-leading-order calculations from BlackHat + sherpa. The differential cross sections are found to be in agreement with the predictions, apart from the pT distributions of the leading jets at high pT values, the distributions of the HT at high-HT and low jet multiplicity, and the distribution of the difference in azimuthal angle between the leading jet and the muon at low values.United States. Dept. of EnergyNational Science Foundation (U.S.)Alfred P. Sloan Foundatio

Schadevergoeding bij overlijden: een stoel die een soort tafeltje is

In het aansprakelijkheidsrecht heeft een benadeelde in beginsel recht op volledige vergoeding van zijn schade. De gevolgen van de schadetoebrengende gebeurtenis dienen zoveel als mogelijk te worden weggenomen of te worden gecompenseerd. Daarbij wordt gekeken naar de situatie waarin de benadeelde zou hebben verkeerd indien de schadetoebrengende gebeurtenis niet zou hebben plaatsgevonden. Dat is bij overlijden per definitie problematisch. Er is iemand weggevallen, wat vele gevolgen heeft. De schade als gevolg van het overlijden komt maar beperkt voor vergoeding in aanmerking. In artikel 6:108 BW is een drietal beperkingen te vinden. Het gaat hier om beperkingen ten aanzien van de aard van de schade, de kring van gerechtigden en de omvang van de schade. Daarbij hinkt het recht op schadevergoeding bij overlijden op twee gedachten. Aan de ene kant is er het aansprakelijkheidsrecht, maar de geleden schade komt niet volledig voor vergoeding in aanmerking. Aan de andere kant is er het recht op alimentatie uit het familierecht, maar dat wordt bij overlijden niet consequent toegepast. De motieven voor de beperkingen van het recht op schadevergoeding zijn achterhaald en niet (langer) overtuigend. Het recht is niet bij de tijd, het sluit niet aan bij de maatschappelijke ontwikkelingen. De beperkingen die het recht op schadevergoeding bij overlijden in de huidige samenleving met zich meebrengt zorgen voor complexe methoden om de nabestaanden tegemoet te komen en oogsten daardoor veel kritiek. In deze bijdrage wordt die kritiek besproken. De bijdrage wordt afgesloten met enkele denkrichtingen voor nader onderzoek

Search for stop and higgsino production using diphoton Higgs boson decays

Results are presented of a search for a "natural" supersymmetry scenario with gauge mediated symmetry breaking. It is assumed that only the supersymmetric partners of the top-quark (stop) and the Higgs boson (higgsino) are accessible. Events are examined in which there are two photons forming a Higgs boson candidate, and at least two b-quark jets. In 19.7 inverse femtobarns of proton-proton collision data at sqrt(s) = 8 TeV, recorded in the CMS experiment, no evidence of a signal is found and lower limits at the 95% confidence level are set, excluding the stop mass below 360 to 410 GeV, depending on the higgsino mass